Ramsey goodness of paths
نویسندگان
چکیده
Article history: Received 19 December 2015 Available online 12 July 2016
منابع مشابه
Ordered and partially-ordered variants of Ramsey's theorem
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii PRELIMINARIES AND NOTATION . . . . . . . . . . . . . . . . . . . . . ix CHAPTER 1. OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 The Graph Ramsey Number . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Arrow Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 The Dir...
متن کاملThe Ramsey Number of Loose Paths in 3-Uniform Hypergraphs
Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other: for every n > ⌊ 5m 4 ⌋ , we show that R(P n,P m) = 2n + ⌊m + 1 2 ⌋ .
متن کاملOn the Ramsey Numbers for a Combination of Paths and Jahangirs
For given graphs G and H, the Ramsey number R(G, H) is the least natural number n such that for every graph F of order n the following condition holds: either F contains G or the complement of F contains H. In this paper, we improve the Surahmat and Tomescu’s result [9] on the Ramsey number of paths versus Jahangirs. We also determine the Ramsey number R(∪G, H), where G is a path and H is a Jah...
متن کاملOn size multipartite Ramsey numbers for stars versus paths and cycles
Let Kl×t be a complete, balanced, multipartite graph consisting of l partite sets and t vertices in each partite set. For given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey number mj(G1, G2) is the smallest integer t such that every factorization of the graph Kj×t := F1 ⊕ F2 satisfies the following condition: either F1 contains G1 or F2 contains G2. In 2007, Syafrizal e...
متن کاملRamsey Numbers of Squares of Paths
The Ramsey number R(G,H) has been actively studied for the past 40 years, and it was determined for a large family of pairs (G,H) of graphs. The Ramsey number of paths was determined very early on, but surprisingly very little is known about the Ramsey number for the powers of paths. The r-th power P r n of a path on n vertices is obtained by joining any two vertices with distance at most r. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 122 شماره
صفحات -
تاریخ انتشار 2017